Limitations of lower bound methods for deterministic nested word automata
نویسندگان
چکیده
منابع مشابه
Earliest Query Answering for Deterministic Nested Word Automata
Earliest query answering (eqa) is an objective of streaming algorithms for XML query answering, that aim for close to optimal memory management. In this paper, we show that eqa is infeasible even for a small fragment of XPath unless P=NP. We then present an eqa algorithm for queries and schemas defined by deterministic nested word automata (dnwas) and distinguish a large class of dnwas for whic...
متن کاملWALi: Nested-Word Automata
WALi-NWA is a C++ library for constructing, querying, and operating on nested-word automata. It is a portion of the WALi library, which provides types and operations for weighted automata. While the NWA portions of WALi are mostly logically separate from the rest of WALi, it does use facilities provided by WALi and inter-operates with WALi’s weighted pushdown system (WPDS) code.
متن کاملEquivalence of Deterministic Nested Word to Word Transducers
We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic non-copying order-preserving transducers. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on conte...
متن کاملNondeterministic state complexity of nested word automata
We study the nondeterministic state complexity of Boolean operations on regular languages of nested words. For union and intersection we obtain matching upper and lower bounds. For complementation of a nondeterministic nested word automaton with n states we establish a lower boundΩ( √ n!) that is significantly worse than the exponential lower bound for ordinary nondeterministic finite automata ...
متن کاملLower bound technique for length-reducing automata
The class of growing context-sensitive languages (GCSL) was proposed as a naturally defined subclass of contextsensitive languages whose membership problem is solvable in polynomial time. Growing context-sensitive languages and their deterministic counterpart calledChurch–Rosser languages (CRL) complement theChomskyhierarchy in a naturalway, as the classes filling the gap between context-free l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.11.021